Quasi-Monte Carlo point sets with small $t$-values and WAFOM
نویسنده
چکیده
The t-value of a (t,m, s)-net is an important criterion of point sets for quasiMonte Carlo integration, and many point sets are constructed in terms of tvalues, as this leads to small integration error bounds. Recently, Matsumoto, Saito, and Matoba proposed the Walsh figure of merit (WAFOM) as a quickly computable criterion of point sets that ensure higher order convergence for function classes of very high smoothness. In this paper, we consider a search algorithm for point sets whose t-value and WAFOM are both small so as to be effective for a wider range of function classes. For this, we fix digital (t,m, s)nets with small t-values (e.g., Sobol’ or Niederreiter–Xing nets) in advance, apply random linear scrambling, and select scrambled digital (t,m, s)-nets in terms of WAFOM. Experiments show that the obtained point sets improve the rates of convergence for smooth functions and are robust for non-smooth functions.
منابع مشابه
A search for extensible low-WAFOM point sets
Matsumoto, Saito, and Matoba recently proposed the Walsh figure of merit (WAFOM), which is a computable criterion for quasi-Monte Carlo point sets using digital nets. Several algorithms have been proposed for finding low-WAFOM point sets. In the existing algorithms, the number of points is fixed in advance, but extensible point sets are preferred in some applications. In this paper, we propose ...
متن کاملParallel Quasi-Monte Carlo Integration Using (t, s)-Sequences
Currently, the most eeective constructions of low-discrepancy point sets and sequences are based on the theory of (t; m; s)-nets and (t; s)-sequences. In this work we discuss parallelization techniques for quasi-Monte Carlo integration using (t; s)-sequences. We show that leapfrog parallelization may be very dangerous whereas block-based paral-lelization turns out to be robust.
متن کاملOn Selection Criteria for Lattice Rules and Other Quasi-Monte Carlo Point Sets
We deene new selection criteria for lattice rules for quasi-Monte Carlo integration. The criteria examine the projections of the lattice over subspaces of small or successive dimensions. Their computation exploits the dimension-stationarity of certain lattice rules, and of other low-discrepancy point sets sharing this property. Numerical results illustrate the usefulness of these new gures of m...
متن کاملDiscrepancy, Integration and Tractability
The discrepancy function of a point distribution measures the deviation from the uniform distribution. Different versions of the discrepancy function capture this deviation with respect to different geometric objects. Via Koksma-Hlawka inequalities the norm of the discrepancy function in a function space is intimately connected to the worst case integration error of the quasi-Monte Carlo integr...
متن کاملNew star discrepancy bounds for ( t , m , s ) - nets and ( t , s ) - sequences
In this paper, we derive new general upper bounds on the star discrepancy of (t,m, s)-nets and (t, s)-sequences. These kinds of point sets are among the most widely used in quasi-Monte Carlo methods for numerical integration. By our new results, we improve on previous discrepancy bounds and prove a conjecture stated by the second author in an earlier paper.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 254 شماره
صفحات -
تاریخ انتشار 2015